Tableaux Modulo Theories Using Superdeduction

We propose a method that allows us to develop tableaux modulo theories using the principles of superdeduction, among which the theory is used to enrich the deduction system with new deduction rules. This method is presented in the framework of the Zenon automated theorem prover, and is applied to the set theory of the B method. This allows us to provide another prover to Atelier B, which can be used to verify B proof rules in particular. We also propose some benchmarks, in which this prover is able to automatically verify a part of the rules coming from the database maintained by Siemens IC-MOL. Finally, we describe another extension of Zenon with superdeduction, which is able to deal with any first order theory, and provide a benchmark coming from the TPTP library, which contains a large set of first order problems.Comment: arXiv admin note: substantial text overlap with arXiv:1501.0117

Towards correct-by-construction product variants of a software product line: GFML, a formal language for feature modules

Software Product Line Engineering (SPLE) is a software engineering paradigm that focuses on reuse and variability. Although feature-oriented programming (FOP) can implement software product line efficiently, we still need a method to generate and prove correctness of all product variants more efficiently and automatically. In this context, we propose to manipulate feature modules which contain three kinds of artifacts: specification, code and correctness proof. We depict a methodology and a platform that help the user to automatically produce correct-by-construction product variants from the related feature modules. As a first step of this project, we begin by proposing a language, GFML, allowing the developer to write such feature modules. This language is designed so that the artifacts can be easily reused and composed. GFML files contain the different artifacts mentioned above.The idea is to compile them into FoCaLiZe, a language for specification, implementation and formal proof with some object-oriented flavor. In this paper, we define and illustrate this language. We also introduce a way to compose the feature modules on some examples.Comment: In Proceedings FMSPLE 2015, arXiv:1504.0301

A Semantics of ? into Dedukti

? is a semantical framework for formally describing the semantics of programming languages thanks to a BNF grammar and rewriting rules on configurations. It is also an environment that offers various tools to help programming with the languages specified in the formalism. For example, it is possible to execute programs thanks to the generated interpreter, or to check their properties thanks to the provided automatic theorem prover called the KProver. ? is based on la Matching Logic, a first-order logic with an application and fixed-point operators, extended with symbols to encode equality, typing and rewriting. This specific la Matching Logic theory is called Kore. Dedukti is a logical framework having for main goal the interoperability of proofs between different formal proof tools. Several translators to Dedukti exist or are under development, in order to automatically translate formalizations written, for instance, in Coq or PVS. Dedukti is based on the ??-calculus modulo theory, a ?-calculus with dependent types and extended with a primitive notion of computation defined by rewriting rules. The flexibility of this logical framework allows to encode many theories ranging from first-order logic to the Calculus of Constructions. In this article, we present a paper formalization of the translation from ? into Kore, and a paper formalization and an automatic translation tool, called KaMeLo, from Kore to Dedukti in order to execute programs in Dedukti

Comparing EvenB, {log}\{log\} and Why3 Models of Sparse Sets

Many representations for sets are available in programming languages libraries. The paper focuses on sparse sets used, e.g., in some constraint solvers for representing integer variable domains which are finite sets of values, as an alternative to range sequence. We propose in this paper verified implementations of sparse sets, in three deductive formal verification tools, namely EventB, $\{log\}$ and Why3. Furthermore, we draw some comparisons regarding specifications and proofs

Heritage landscapes in Wallonia (Belgium): the witness landscape approach.

peer reviewedDès 2000, pour répondre aux exigences de la convention européenne du Paysage, la Région wallonne a lancé un programme de recherche au sein de la Conférence permanente du Développement territorial (CPDT). Les travaux se sont concentrés sur l’identification des macro-paysages wallons, puis sur leur caractérisation et leur qualification patrimoniale. L’article retrace le cheminement de cette recherche (définition des concepts de paysage et de paysage patrimonial, démarche adoptée) et présente la méthode d’appréciation des valeurs scientifiques des paysages, méthode dite « des paysages témoins », ainsi que les limites de son application. Lire, déchiffrer, comprendre et documenter le paysage pour mettre en lumière des composantes et configurations paysagères porteuses d’information et de signification, telle a été l’une des contributions de l’équipe CPDT à la connaissance des paysages en vue de leur gestion informéeIn 2000, the Walloon Region (Belgium) has initiated a research program at the Standing Conference on Territorial Development (CPDT) in order to address the European Landscape Convention requirements. The research concentrated at first on the identification and the typology of Walloon macrolandscapes at a regional scale. Then the research focussed on the landscapes characterisation at a scale of 1/20 000 and their patrimonial qualification. The paper traces the research progress (definition of the concepts of landscape and patrimonial landscape, the adopted procedure) and presents the elaborated method to appreciate the landscapes scientific values, called the method of the “witness landscape”. It also presents the difficulties met during its application on the field. The method is iterative and combines the observation on the field, the review of both historic and present cartographies, the interpretation of aerial photographs and the mobilisation of the available bibliography. Reading, analysing, understanding and documenting the landscape in order to highlight the meaningful landscapes’ configurations and components, such was one of the research team contributions to the landscape management

Actes des Sixièmes journées nationales du Groupement De Recherche CNRS du Génie de la Programmation et du Logiciel

National audienceCe document contient les actes des Sixièmes journées nationales du Groupement De Recherche CNRS du Génie de la Programmation et du Logiciel (GDR GPL) s'étant déroulées au CNAM à Paris du 11 au 13 juin 2014. Les contributions présentées dans ce document ont été sélectionnées par les différents groupes de travail du GDR. Il s'agit de résumés, de nouvelles versions, de posters et de démonstrations qui correspondent à des travaux qui ont déjà été validés par les comités de programmes d'autres conférences et revues et dont les droits appartiennent exclusivement à leurs auteurs